Seidel Signless Laplacian Energy of Graphs

Authors

Abstract:

Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+}(G)$ is defined as the sum of the absolute deviations of the eigenvalues of $SL^+(G)$ from their mean. In this paper, we establish the main properties of the eigenvalues of $SL^+(G)$ and of $E_{SL^+}(G)$.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

The signless Laplacian coefficients and incidence energy of bicyclic graphs

Article history: Received 7 February 2013 Accepted 15 October 2013 Available online 4 November 2013 Submitted by S. Kirkland

full text

The Signless Laplacian Estrada Index of Unicyclic Graphs

‎For a simple graph $G$‎, ‎the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$‎, ‎where $q^{}_1‎, ‎q^{}_2‎, ‎dots‎, ‎q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$‎. ‎In this paper‎, ‎we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...

full text

Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...

full text

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

full text

Ela the Signless Laplacian Separator of Graphs

Received by the editors on July 22, 2010. Accepted for publication on February 17, 2011. Handling Editor: Bryan Shader. School of Mathematical Science, South China Normal University, Guangzhou, 510631, P.R. China ([email protected], Zhifu You; [email protected], Bolian Liu). This work was supported by the NNSF of China (No. 11071088). Electronic Journal of Linear Algebra ISSN 1081-3810 A publi...

full text

Signless Laplacian eigenvalues and circumference of graphs

In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 2

pages  181- 191

publication date 2017-12-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023